- correct formalization
- мат.корректная формализация
English-Russian scientific dictionary. 2008.
correct formalization
Смотреть что такое "correct formalization" в других словарях:
Recursion theory — Recursion theory, also called computability theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown to include the study of generalized computability… … Wikipedia
Computability theory — For the concept of computability, see Computability. Computability theory, also called recursion theory, is a branch of mathematical logic that originated in the 1930s with the study of computable functions and Turing degrees. The field has grown … Wikipedia
Algorithm — Flow chart of an algorithm (Euclid s algorithm) for calculating the greatest common divisor (g.c.d.) of two numbers a and b in locations named A and B. The algorithm proceeds by successive subtractions in two loops: IF the test B ≤ A yields yes… … Wikipedia
Halting problem — In computability theory, the halting problem can be stated as follows: Given a description of a computer program, decide whether the program finishes running or continues to run forever. This is equivalent to the problem of deciding, given a… … Wikipedia
Natural language processing — (NLP) is a field of computer science and linguistics concerned with the interactions between computers and human (natural) languages; it began as a branch of artificial intelligence.[1] In theory, natural language processing is a very attractive… … Wikipedia
New algebra — The new algebra or symbolic analysis is a formalization of algebra promoted by François Viète in 1591 and by his successors (after 1603). It marks the beginning of the algebraic formalization (late sixteenth the early seventeenth centuries).… … Wikipedia
Gödel's incompleteness theorems — In mathematical logic, Gödel s incompleteness theorems, proved by Kurt Gödel in 1931, are two theorems stating inherent limitations of all but the most trivial formal systems for arithmetic of mathematical interest. The theorems are of… … Wikipedia
Counterpart theory — In philosophy, specifically in the area of modal metaphysics, counterpart theory is an alternative to standard (Kripkean) possible worlds semantics for interpreting quantified modal logic. Counterpart theory still presupposes possible worlds, but … Wikipedia
Mathematical logic — (also known as symbolic logic) is a subfield of mathematics with close connections to foundations of mathematics, theoretical computer science and philosophical logic.[1] The field includes both the mathematical study of logic and the… … Wikipedia
education — /ej oo kay sheuhn/, n. 1. the act or process of imparting or acquiring general knowledge, developing the powers of reasoning and judgment, and generally of preparing oneself or others intellectually for mature life. 2. the act or process of… … Universalium
Axiom — This article is about logical propositions. For other uses, see Axiom (disambiguation). In traditional logic, an axiom or postulate is a proposition that is not proven or demonstrated but considered either to be self evident or to define and… … Wikipedia
